<title>食堂上菜</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span> <span class="pl-cpf">&lt;bits/stdc++.h&gt;</span><span class="pl-cp"></span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-k">const</span> <span class="pl-kt">int</span> <span class="pl-n">N</span> <span class="pl-o">=</span> <span class="pl-mi">20000</span> <span class="pl-o">*</span> <span class="pl-mi">5</span> <span class="pl-o">+</span> <span class="pl-mi">10</span><span class="pl-p">;</span>
<span class="pl-kt">int</span> <span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">N</span><span class="pl-p">],</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">ans</span><span class="pl-p">;</span>
<span class="pl-n">vector</span><span class="pl-o">&lt;</span><span class="pl-kt">int</span><span class="pl-o">&gt;</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">N</span> <span class="pl-o">/</span> <span class="pl-mi">5</span><span class="pl-p">];</span>
<span class="pl-kt">void</span> <span class="pl-nf">add</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">y</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-k">for</span> <span class="pl-p">(;</span> <span class="pl-n">x</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">x</span> <span class="pl-o">+=</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">&amp;</span> <span class="pl-o">-</span><span class="pl-n">x</span><span class="pl-p">))</span> <span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">],</span> <span class="pl-n">y</span><span class="pl-p">);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">ask</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">x</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">aans</span> <span class="pl-o">=</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">for</span> <span class="pl-p">(;</span> <span class="pl-n">x</span><span class="pl-p">;</span> <span class="pl-n">x</span> <span class="pl-o">-=</span> <span class="pl-p">(</span><span class="pl-n">x</span> <span class="pl-o">&amp;</span> <span class="pl-o">-</span><span class="pl-n">x</span><span class="pl-p">))</span> <span class="pl-n">aans</span> <span class="pl-o">=</span> <span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">aans</span><span class="pl-p">,</span> <span class="pl-n">c</span><span class="pl-p">[</span><span class="pl-n">x</span><span class="pl-p">]);</span>
    <span class="pl-k">return</span> <span class="pl-n">aans</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kr">inline</span> <span class="pl-kt">int</span> <span class="pl-nf">input</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">t</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">t</span><span class="pl-p">);</span>
    <span class="pl-k">return</span> <span class="pl-n">t</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;dinning.in&quot;</span><span class="pl-p">,</span> <span class="pl-s">&quot;r&quot;</span><span class="pl-p">,</span> <span class="pl-n">stdin</span><span class="pl-p">);</span>
    <span class="pl-n">freopen</span><span class="pl-p">(</span><span class="pl-s">&quot;dinning.out&quot;</span><span class="pl-p">,</span> <span class="pl-s">&quot;w&quot;</span><span class="pl-p">,</span> <span class="pl-n">stdout</span><span class="pl-p">);</span>
    <span class="pl-n">n</span> <span class="pl-o">=</span> <span class="pl-mi">5</span> <span class="pl-o">*</span> <span class="pl-n">input</span><span class="pl-p">();</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">a</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">input</span><span class="pl-p">()].</span><span class="pl-n">push_back</span><span class="pl-p">(</span><span class="pl-n">i</span><span class="pl-p">);</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">input</span><span class="pl-p">();</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-p">{</span>
        <span class="pl-kt">int</span> <span class="pl-n">x</span> <span class="pl-o">=</span> <span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">];</span>
        <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">j</span> <span class="pl-o">=</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]].</span><span class="pl-n">size</span><span class="pl-p">()</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">j</span> <span class="pl-o">&gt;=</span> <span class="pl-mi">0</span><span class="pl-p">;</span> <span class="pl-n">j</span><span class="pl-o">--</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-kt">int</span> <span class="pl-n">pos</span> <span class="pl-o">=</span> <span class="pl-n">p</span><span class="pl-p">[</span><span class="pl-n">b</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]][</span><span class="pl-n">j</span><span class="pl-p">];</span>
            <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">pos</span><span class="pl-p">]</span> <span class="pl-o">=</span> <span class="pl-n">ask</span><span class="pl-p">(</span><span class="pl-n">pos</span> <span class="pl-o">-</span> <span class="pl-mi">1</span><span class="pl-p">)</span> <span class="pl-o">+</span> <span class="pl-mi">1</span><span class="pl-p">;</span>
            <span class="pl-n">add</span><span class="pl-p">(</span><span class="pl-n">pos</span><span class="pl-p">,</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">pos</span><span class="pl-p">]);</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">for</span> <span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span> <span class="pl-o">=</span> <span class="pl-mi">1</span><span class="pl-p">;</span> <span class="pl-n">i</span> <span class="pl-o">&lt;=</span> <span class="pl-n">n</span><span class="pl-p">;</span> <span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">)</span> <span class="pl-n">ans</span> <span class="pl-o">=</span> <span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">ans</span><span class="pl-p">,</span> <span class="pl-n">f</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
    <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">ans</span><span class="pl-p">);</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>